Positive Polynomials and Sums of Squares: Theory and Practice

نویسنده

  • Victoria Powers
چکیده

If a real polynomial f can be written as a sum of squares of real polynomials, then clearly f is nonnegative on R, and an explicit expression of f as a sum of squares is a certificate of positivity for f . This idea, and generalizations of it, underlie a large body of theoretical and computational results concerning positive polynomials and sums of squares. In this survey article, we review the history of the subject and give an overview of recent results, both theoretical results concerning the existence of certificates of positivity and work on computational and algorithmic issues.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sums of Squares, Moment Matrices and Optimization over Polynomials

We consider the problem of minimizing a polynomial over a semialgebraic set defined by polynomial equations and inequalities, which is NP-hard in general. Hierarchies of semidefinite relaxations have been proposed in the literature, involving positive semidefinite moment matrices and the dual theory of sums of squares of polynomials. We present these hierarchies of approximations and their main...

متن کامل

Abstract cones of positive polynomials and their sums of squares relaxations

cones of positive polynomials and their sums of squares relaxations

متن کامل

\Positive" Non-Commutative Polynomials are Sums of Squares

Hilbert's 17th problem concerns expressing polynomials on R as a sum of squares. It is well known that many positive polynomials are not sums of squares; see [R00] [deA preprt] for excellent surveys. In this paper we consider symmetric non-commutative polynomials and call one \matrix positive", if whenever matrices of any size are substituted for the variables in the polynomial the matrix value...

متن کامل

Symmetric, Positive Semidefinite Polynomials Which

This paper presents a construction for symmetric, non-negative polynomials, which are not sums of squares. It explicitly generalizes the Motzkin polynomial and the Robinson polynomials to families of non-negative polynomials, which are not sums of squares. The degrees of the resulting polynomials can be chosen in advance. 2000 Mathematics Subject Classification: 12Y05, 20C30, 12D10, 26C10, 12E10

متن کامل

Randomization, Sums of Squares, and Faster Real Root Counting for Tetranomials and Beyond

Suppose f is a real univariate polynomial of degree D with exactly 4 monomial terms. We present an algorithm, with complexity polynomial in logD on average (relative to the stable log-uniform measure), for counting the number of real roots of f . The best previous algorithms had complexity super-linear in D. We also discuss connections to sums of squares and A-discriminants, including explicit ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011